nearest neighbor searching

См. также в других словарях:

• Nearest neighbor search — (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point… …   Wikipedia

• k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… …   Wikipedia

• David Mount — Not to be confused with David W. Mount, Professor Emeritus of Molecular and Cellular Biology at the University of Arizona. David Mount is currently a Professor at The University of Maryland (College Park Campus) whose research is in Computational …   Wikipedia

• Cover tree — The cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed up of a nearest neighbor search. It is a refinement of the Navigating Net data structure, and related to a variety of other data… …   Wikipedia

• Kd-trie — A k d trie is a spatial data structure for indexing points in k dimensional space. It is a variation on the k d tree that only stores points in the leaf nodes, sometimes in small collections called bins or buckets. Internal nodes only store the… …   Wikipedia

• The Freesound Project — is a repository of Creative Commons licensed audio samples. Sounds uploaded to the website by its users cover a wide range of subjects, from field recordings to synthesized sound effects. All audio content in the repository is released under the… …   Wikipedia

• Árbol kd — Un árbol kd tridimensional. La primera división (rojo) corta la celda raíz (blanco) en dos subceldas, que son divididas a su vez (verde) en dos subceldas. Finalmente, cada una de esas cuatro es dividida (azul) en dos subceldas. Dado que no hay… …   Wikipedia Español

• Curse of dimensionality — The curse of dimensionality refers to various phenomena that arise when analyzing and organizing high dimensional spaces (often with hundreds or thousands of dimensions) that do not occur in low dimensional settings such as the physical space… …   Wikipedia

• Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… …   Wikipedia

• Z-order curve — Not to be confused with Z curve or Z order. Four iterations of the Z order curve …   Wikipedia

• Tree rearrangement — Tree rearrangements are used in heuristic algorithms devoted to searching for an optimal tree structure. They can be applied to any set of data that are naturally arranged into a tree, but have most applications in computational phylogenetics,… …   Wikipedia